2003～2011年中国科普法规政策与化学普及书籍关系研究

2002年中国颁布科普法后,2003至2011年出版的化学普及书籍种数总体呈上升趋势。出版地和出版社总体上较为分散,局部集中度高。主题上基础知识类化学普及书籍最多,科学文化类次之,实用知识类较少,化学前沿类最少。涉及科普的一般法律、法规和政策对化学普及书籍的创作影响甚微。只有与国家约束性社会发展指标相关,发生涉及公民生命安全的重大社会事件,针对特定人群的具体实施政策出台,科普法规和政策才对化学普及书籍的出版起到推动作用。     

随机排序模型及求解方法

本文介绍了随机排序模型,并对求解随机排序的基本方法作一简要综述。     

检测实验室如何开展管理评审工作

详细论述了管理评审的基本概念、如何开展管理评审工作以及中国实验室国家认可委员会的有关政策。     

连续时间马尔可夫决策过程的折扣模型

本文考虑的是转移速率族任意且费用率函数可能无界的连续时间马尔可夫决策过程的折扣模型．放弃了传统的要求相应于每个策略的　Ｑ　－过程唯一等条件,而首次考虑相应每个策略的　Ｑ　－过程不一定唯一,　转移速率族也不一定保守,　费用率函数可能无界,　且允许行动空间非空任意的情形．　本文首次用"α－折扣费用最优不等式"更新了传统的α－折扣费用最优方程,并用"最优不等式"和新的方法,不仅证明了传统的主要结果即最优平稳策略的存在性,　而且还进一步探讨了（　∈＞０　　）－最优平稳策略,具有单调性质的最优平稳策略,　以及（∈≥０）　－最优决策过程的存在性,　得到了一些有意义的新结果．　最后,　提供了一个迁移率受控的生灭系统例子,　它满足本文的所有条件,　而传统的假设（见文献［１－１４］）均不成立．     

展望21世纪风能的利用与发展

本介绍了国内外风能利用的现状,并对我国未来风能的利用与发展提出了很多建设性的意见,诸如：发展目标的确立,政策、法规体系的建立,技术性能的提高及新产品的开发,经济鼓励政策及其实施,产业化体系的建设等。     

$${\cal K}$$-Convexity1 in $$\Re^{n}$$

We generalize the concept of K-convexity to an n-dimensional Euclidean space. The resulting concept of -convexity is useful in addressing production and inventory problems where there are individual product setup costs and/or joint setup costs. We derive some basic properties of -convex functions. We conclude the paper with some suggestions for future research. Support from Columbia University and University of Texas at Dallas is gratefully acknowledged. Helpful comments from Qi Feng are appreciated.     

Threshold-based interventions to optimize performance in preemptive priority queues

This paper studies a single-server priority queueing model in which preemptions are allowed during the early stages of service. Once enough service effort has been rendered, however, further preemptions are blocked. The threshold where the change occurs is either a proportion of the service requirement, or time-based. The Laplace–Stieltjes transform and mean of each class sojourn time are derived for a model which employs this hybrid preemption policy. Both preemptive resume and preemptive repeat service disciplines are considered. Numerical examples show that it is frequently the case that a good combination of preemptible and nonpreemptible service performs better than both the standard preemptive and nonpreemptive queues. In a number of these cases, the thresholds that optimize performance measures such as overall average sojourn time are determined. This revised version was published online in June 2006 with corrections to the Cover Date.     

Applications of SMP Bounds to Multi-class Traffic in High-speed Networks

In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are multiplexed onto a single output channel using one of the service scheduling policies: the Timed Round Robin Policy or the Static Priority Service Policy. The Quality of Service requirements for each class are based on cell loss probabilities. Using effective bandwidth methodologies and the recently developed bounds for semi-Markov modulated traffic, we solve call admission control problems for the two service scheduling policies at this node. We compare the performance of the effective bandwidth methodologies and the SMP bounds technique. We also numerically compare the performance of the two service scheduling policies.     

非平稳MDP平均模型── 一致最优(G,B)-生成策略的存在性

本文考虑的是可数状态空间任意行动空间非平稳ＭＤＰ平均模型,借鉴于Ｆｅｉｎｂｅｒｇ Ｅ． Ａ（１９９４）的思想,提出了比马氏策略和 Ｆｅｉｎｂｅｒｇ Ｅ． Ａ的（ｆ,Ｂ）－生成策略和更为广泛的（Ｇ,Ｂ）－生成策略的概念,在弱遍历条件下,用概率分析的方法,证明了一致最优（Ｇ,Ｂ）－生成策略的存在性．从而将 Ｆｅｉｎｂｅｒｇ Ｅ． Ａ．（１９９４）的主要结果推广到非平衡可数状态空间情形．     

Production systems with interruptions, arbitrary topology and finite buffers

We consider a production system with finite buffers and arbitrary topology where service time is subject to interruptions in one of three ways, viz. machine breakdown, machine vacations or Npolicy. We develop a unified approximation (analytical) methodology to calculate the throughput of the system using queueing networks together with decomposition, isolation and expansion techniques. The methodology is rigorously tested covering a large experimental region. Orthogonal arrays are used to design the experiments in order to keep the number of experiments manageable. The results obtained using the approximation methodology are compared to the simulation results. The ttests carried out to investigate the differences between the two results show that they are statistically insignificant. Finally, we test the methodology by applying it to several arbitrary topology networks. The results show that the performance of the approximation methodology is consistent, robust and produces excellent results in a variety of experimental conditions.